Ela Zeros of Unilateral Quaternionic Polynomials
نویسنده
چکیده
The purpose of this paper is to show how the problem of finding the zeros of unilateral n-order quaternionic polynomials can be solved by determining the eigenvectors of the corresponding companion matrix. This approach, probably superfluous in the case of quadratic equations for which a closed formula can be given, becomes truly useful for (unilateral) n-order polynomials. To understand the strength of this method, it is compared with the Niven algorithm and it is shown where this (full) matrix approach improves previous methods based on the use of the Niven algorithm. For convenience of the readers, some examples of second and third order unilateral quaternionic polynomials are explicitly solved. The leading idea of the practical solution method proposed in this work can be summarized in the following three steps: translating the quaternionic polynomial in the eigenvalue problem for its companion matrix, finding its eigenvectors, and, finally, giving the quaternionic solution of the unilateral polynomial in terms of the components of such eigenvectors. A brief discussion on bilateral quaternionic quadratic equations is also presented.
منابع مشابه
The classification and the computation of the zeros of quaternionic, two-sided polynomials
Already for a long time it is known that quaternionic polynomials whose coefficients are located only at one side of the powers, may have two classes of zeros: isolated zeros and spherical zeros. Only recently a classification of the two types of zeros and a means to compute all zeros of such polynomials have been developed. In this investigation we consider quaternionic polynomials whose coeff...
متن کاملComputing the Zeros of Quaternion Polynomials
A method is developed to compute the zeros of a quaternion polynomial with all terms of the form ok Xk. This method is based essentially in Niven’s algorithm (11, which consists of dividing the polynomial by a characteristic polynomial associated to a zero. The information about the trace and the norm of the zero is obtained by an original idea which requires the companion matrix associated to ...
متن کاملSome compact generalization of inequalities for polynomials with prescribed zeros
Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$. In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$, $k^2 leq rRleq R^2$ and for $Rleq r leq k$. Our results refine and generalize certain well-known polynomial inequalities.
متن کاملNormalization of Quaternionic Polynomials
Quaternionic polynomials are generated by quaternionic variables and the quaternionic product. This paper proposes the generating ideal of quaternionic polynomials in tensor algebra, finds the Gröbner base of the ideal in the case of pure imaginary quaternionic variables, and describes the normal forms of such quaternionic polynomials explicitly.
متن کاملPolynomials and Vandermonde Matrices over the Field of Quaternions
It is known that the space of real valued, continuous functions C(B) over a multidimensional compact domain B ⊂ R , k ≥ 2 does not admit Haar spaces, which means that interpolation problems in finite dimensional subspaces V of C(B) may not have a solutions in C(B). The corresponding standard short and elegant proof does not apply to complex valued functions over B ⊂ C. Nevertheless, in this sit...
متن کامل